Duality for a class of nondifferentiable mathematical programming problems
نویسندگان
چکیده
منابع مشابه
Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming
and Applied Analysis 3 It can be easily seen that for a compact convex set C, y is in NC x if and only if S y | C xy, or equivalently, x is in ∂S y | C . Definition 2.2. A functional F : X × X × R → R where X ⊆ R is sublinear with respect to the third variable if for all x, u ∈ X ×X, i F x, u; a1 a2 ≤ F x, u; a1 F x, u; a2 for all a1, a2 ∈ R, ii F x, u;αa αF x, u; a , for all α ∈ R and for all ...
متن کاملOn second-order converse duality for a nondifferentiable programming problem
A second-order dual for a nonlinear programming problem was introduced by Mangasarian ([1]). Later, Mond [2] proved duality theorems under a condition which is called “second-order convexity”. This condition is much simpler than that used by Mangasarian. Later, Mond and Weir [3] reformulated the second-order dual. In [4], Mond considered the class of nondifferentiable mathematical programming p...
متن کاملSymmetric duality for a higher-order nondifferentiable multiobjective programming problem
*Correspondence: [email protected] 1Department of Mathematics, Indian Institute of Technology, Roorkee, 247 667, India Full list of author information is available at the end of the article Abstract In this paper, a pair of Wolfe type higher-order nondifferentiable symmetric dual programs over arbitrary cones has been studied and then well-suited duality relations have been established consider...
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1981
ISSN: 0022-247X
DOI: 10.1016/0022-247x(81)90025-1